The minimum number of Fox colors modulo 13 is 5
نویسندگان
چکیده
منابع مشابه
On the minimum number of colors for knots
In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on the features of modular arithmetic. We introduce a sequence of transformation...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...
متن کاملNumber of discernible object colors is a conundrum.
Widely varying estimates of the number of discernible object colors have been made by using various methods over the past 100 years. To clarify the source of the discrepancies in the previous, inconsistent estimates, the number of discernible object colors is estimated over a wide range of color temperatures and illuminance levels using several chromatic adaptation models, color spaces, and col...
متن کاملThe number of tiered posets modulo six
Our goal in this note is to sketch a proof of a conjecture made by Kreweras [1] in a paper published in this journal. A poset on an n-set is said to be tiered with height h if every element belongs to a maximal chain with exactly h elements. It is easy to visualize these posets in terms of their Hasse diagrams. The elements can be arranged in tiers with the minimal elements in the first tier an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2017
ISSN: 0166-8641
DOI: 10.1016/j.topol.2016.11.001